A novel access control method using Morton number and prime factorization
نویسندگان
چکیده
منابع مشابه
A novel access control method using Morton number and prime factorization
A novel scheme used for controlling access requests in security information system is proposed. In the proposed method, the system administrator chooses distinct prime numbers representing each atomic access right as well as four large prime numbers for encryption. By setting these representative prime numbers as input parameters, the proposed method applies a one-way function combining the Mor...
متن کاملA New Access Control Method Using Prime Factorisation
Based on prime factorisation in number theory, a new but simple and efficient protection method for access control is proposed. This method has several advantages on performance over previous methods in the literature. Especially, a file I user can be added to or removed from the system without much effort. Excellence of this method is more pronounced for those systems where files are accessibl...
متن کاملneural classifier ensemble using error-correcting output codes: access control application
abstract biometric access control is an automatic system that intelligently provides the access of special actions to predefined individuals. it may use one or more unique features of humans, like fingerprint, iris, gesture, 2d and 3d face images. 2d face image is one of the important features with useful and reliable information for recognition of individuals and systems based on this ...
Applications of Prime Factorization of Ideals in Number Fields
For a number fieldK, that is, a finite extension of Q, and a prime number p, a fundamental theorem of algebraic number theory implies that the ideal (p) ⊆ OK factors uniquely into prime ideals as (p) = p1 1 · · · p eg g . In this paper we explore different interpretations of this using the factorization of polynomials in finite and p-adic fields and Galois theory. In particular, we present some...
متن کاملFactorization of Prime Ideal Extensions in Number Rings
Following an idea of Kronecker, we describe a method for factoring prime ideal extensions in number rings. The method needs factorization of polynomials in many variables over finite fields, but it works for any prime and any number field extension. Introduction Let F c K be number fields, let ¿fp c <?* be their corresponding number rings, i.e., the integral closures of Z in F and K, respective...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2000
ISSN: 0020-0255
DOI: 10.1016/s0020-0255(00)00073-6